The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose an extended block Krylov process to construct two biorthogonal bases for the extended Krylov subspaces $$\mathbb {K}_{m}^e(A,V)$$ Kme(A,V) and $$\mathbb {K}_{m}^e(A^{T},W)$$ Kme(AT,W) , where $$A \in \mathbb {R}^{n \times n}$$ A∈Rn×n and $$V,~W \in \mathbb {R}^{n \times p}$$ V,W∈Rn×p . After deriving some new theoretical results and algebraic properties, we apply the proposed...
We introduce a two-parameter version of the two-step scale-splitting iteration method, called TTSCSP, for solving a broad class of complex symmetric system of linear equations. We present some conditions for the convergence of the method. An upper bound for the spectral radius of the method is presented and optimal parameters which minimize this bound are given. Inexact version of the TTSCSP iteration...
Chebyshev pseudo-spectral method is one of the most efficient methods for solving continuous-time optimization problems. In this paper, we utilize this method to solve the general form of shortest path problem. Here, the main problem is converted into a nonlinear programming problem and by solving of which, we obtain an approximate shortest path. The feasibility of the nonlinear programming problem...
We propose a novel kernel-based method for image reconstruction from scattered Radon data. To this end, we employ generalized Hermite–Birkhoff interpolation by positive definite kernel functions. For radial kernels, however, a straightforward application of the generalized Hermite–Birkhoff interpolation method fails to work, as we prove in this paper. To obtain a well-posed reconstruction scheme for...
We study a velocity–vorticity scheme for the 2D incompressible Navier–Stokes equations, which is based on a formulation that couples the rotation form of the momentum equation with the vorticity equation, and a temporal discretization that stably decouples the system at each time step and allows for simultaneous solving of the vorticity equation and velocity–pressure system (thus if special care is...
This paper deals with interpolatory product integration rules based on Jacobi nodes, associated with the Banach space of all s-times continuously differentiable functions, and with a Banach space of absolutely integrable functions, on the interval $$[-1,1]$$ [-1,1] of the real axis. In order to highlight the topological structure of the set of unbounded divergence for the corresponding product quadrature...
Some error analyses on virtual element methods (VEMs) including inverse inequalities, norm equivalence, and interpolation error estimates are developed for polygonal meshes, each element of which admits a virtual quasi-uniform triangulation. This sub-mesh regularity covers the usual ones used for theoretical analysis of VEMs, and the proofs are presented by means of standard technical tools in finite...
A Neumann series of Bessel functions (NSBF) representation for solutions of Sturm–Liouville equations and for their derivatives is obtained. The representation possesses an attractive feature for applications: for all real values of the spectral parameter $$\omega $$ ω the estimate of the difference between the exact solution and the approximate one (the truncated NSBF) depends on N (the truncation...
In this paper, we provide three types of general convergence theorems for Picard iteration in n-dimensional vector spaces over a valued field. These theorems can be used as tools to study the convergence of some particular Picard-type iterative methods. As an application, we present a new semilocal convergence theorem for the one-dimensional Newton method for approximating all the zeros of a polynomial...
We address and discuss the application of nonlinear Galerkin methods for the model reduction and numerical solution of partial differential equations (PDE) with Turing instabilities in comparison with standard (linear) Galerkin methods. The model considered is a system of PDEs modelling the pattern formation in vegetation dynamics. In particular, by constructing the approximate inertial manifold on...
We present an iterative procedure based on a damped inexact Newton iteration for solving linear complementarity problems. We introduce the method in the framework of a popular problem arising in mechanical engineering: the analysis of cavitation in lubricated contacts. In this context, we show how the perturbation and the damping parameter are chosen in our method and we prove the global convergence...
In this paper, we introduce implicit and explicit iterative methods for finding a zero of a monotone variational inclusion in Hilbert spaces. As consequence, an improvement modification of an algorithm existing in literature is obtained. A numerical example is given for illustrating our algorithm.
In this paper, we propose a locking-free stabilized mixed finite element method for the linear elasticity problem, which employs a jump penalty term for the displacement approximation. The continuous piecewise k-order polynomial space is used for the stress and the discontinuous piecewise $$(k-1)$$ (k-1) -order polynomial space for the displacement, where we require that $$k\ge 3$$ k≥3 in the two...
An interval extension of successive matrix squaring (SMS) method for computing the weighted Moore–Penrose inverse $$A^{\dagger }_{MN}$$ AMN† along with its rigorous error bounds is proposed for given full rank $$m \times n$$ m×n complex matrices A, where M and N be two Hermitian positive definite matrices of orders m and n, respectively. Starting with a suitably chosen complex interval matrix containing...
The three-term conjugate gradient methods solving large-scale optimization problems are favored by many researchers because of their nice descent and convergent properties. In this paper, we extend some new conjugate gradient methods, and construct some three-term conjugate gradient methods. An remarkable property of the proposed methods is that the search direction always satisfies the sufficient...
This paper deals with the numerical methods for solving singular initial value problems. By adapting the block boundary value methods (BBVMs) for regular initial value problems, a class of adapted BBVMs are constructed for singular initial value problems. It is proved under some suitable conditions that the adapted BBVMs are uniquely solvable, stable and convergent of order p, where p is the consistence...
This paper is concerned with the analysis of a new stable space–time finite element method (FEM) for the numerical solution of parabolic evolution problems in moving spatial computational domains. The discrete bilinear form is elliptic on the FEM space with respect to a discrete energy norm. This property together with a corresponding boundedness property, consistency and approximation results for...
Motivated by stochastic convection–diffusion problems we derive a posteriori error estimates for non-stationary non-linear convection–diffusion equations acting as a deterministic paradigm. The problem considered here neither fits into the standard linear framework due to its non-linearity nor into the standard non-linear framework due to the lacking differentiability of the non-linearity. Particular...
This work is devoted to a posteriori error analysis of fully discrete finite element approximations to the time dependent Stokes system. The space discretization is based on popular stable spaces, including Crouzeix–Raviart and Taylor–Hood finite element methods. Implicit Euler is applied for the time discretization. The finite element spaces are allowed to change with time steps and the projection...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.